Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
371	PARSING AND HYPERGRAPHS Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2001-10-09 21:41:35 Compiler construction Search algorithms Chart parser Parsing Bottom-up parsing Top-down parsing Tree traversal Hypergraph Shortest path problem Mathematics Graph theory Theoretical computer science
372	iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2015-04-07 01:41:51 Network theory Graph connectivity Reachability R-tree Routing Shortest path problem Pruning Distributed data storage Bx-tree Graph theory Mathematics Theoretical computer science
373	The maximum degree of planar graphs I. Series-parallel graphs Michael Drmota∗ Omer Gim´enez† Add to Reading List Source URL: www.dmg.tuwien.ac.at Language: English - Date: 2010-04-09 02:13:52 Outerplanar graph Series-parallel graph Graph Minor Matroid theory Path decomposition Tree decomposition Graph theory Planar graphs Graph operations
374	Interval Scheduling and Colorful Independent Sets Ren´e van Bevern1,∗ , Matthias Mnich2 , Rolf Niedermeier1 , and Mathias Weller1,† 1 Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-11-07 08:24:33 Clique Interval graph Independent set Claw-free graph Matching Cograph Path decomposition Maximal independent set Graph theory NP-complete problems Graph operations
375	JGraph User Manual JGraph User Manual For JGraph Version – 25th September 2009 Add to Reading List Source URL: touchflow.googlecode.com Language: English Geometric graph theory Topological graph theory Graph Force-based algorithms Graph bandwidth Path decomposition Graph theory Mathematics Graph drawing
376	Small Hop-diameter Sparse Spanners for Doubling Metrics∗ T-H. Hubert Chan Abstract Given a metric M = (V, d), a graph G = (V, E) is a t-spanner for M if every pair of nodes in V has a “short” path (i.e., of length Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2006-01-13 15:54:42 Mathematical analysis Metric geometry Metric space Dimensional analysis Mathematics Topology General topology
377	Efficient All Path Score Computations on Grid Graphs Ury Matarazzo Dekel Tsur Michal Ziv-Ukelson Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-09 03:34:08 Path Network theory Planar graphs Graph theory Mathematics Graph
378	VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size Add to Reading List Source URL: www.dmg.tuwien.ac.at Language: English - Date: 2008-04-04 13:06:24 Outerplanar graph Minor Series-parallel graph Graph Path decomposition Pancyclic graph Graph theory Planar graphs Graph operations
379	24 IP1 ”If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet The ”Flajolet School” of the analysis of algorithms and Add to Reading List Source URL: www.siam.org Language: English - Date: 2012-12-18 10:42:32 Algorithm Mathematical logic Shortest path problem Matching Tree decomposition Matroid Combinatorics Randomized algorithm Mathematics Theoretical computer science Graph theory
380	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2009-03-25 10:41:58 NP-complete problems Network theory Vertex cover Steiner tree problem Shortest path problem Linear programming SL Edge disjoint shortest pair algorithm Pseudoforest Theoretical computer science Graph theory Mathematics